Virtual domination of 3‐manifolds II
نویسندگان
چکیده
For any closed oriented 3-manifold M $M$ with positive simplicial volume and N $N$ , we prove that there exists a finite cover ′ $M^{\prime }$ of admits degree-1 map f : → $f:M^{\prime }\rightarrow N$ is, virtually 1-dominates . This result generalizes previous virtual domination results hyperbolic domain to more general domains.
منابع مشابه
Hop Domination in Graphs-II
Let G = (V,E) be a graph. A set S ⊂ V (G) is a hop dominating set of G if for every v ∈ V − S, there exists u ∈ S such that d(u, v) = 2. The minimum cardinality of a hop dominating set of G is called a hop domination number of G and is denoted by γh(G). In this paper we characterize the family of trees and unicyclic graphs for which γh(G) = γt(G) and γh(G) = γc(G) where γt(G) and γc(G) are the ...
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملOn Point-Set Domination in Graphs II: Minimum PSD-Sets
In this paper, we amend the original proof of a result due to E. Sampathkumar and L. Pushpa Latha [6] as also its variation given in [4] and establish new fundamental results on minimum point-set dominating(psd-)sets in separable graphs.
متن کاملComplexity of Comparing the Domination Number to the Independent Domination, Connected Domination, and Paired Domination Numbers
The domination number γ(G), the independent domination number ι(G), the connected domination number γc(G), and the paired domination number γp(G) of a graph G (without isolated vertices, if necessary) are related by the simple inequalities γ(G) ≤ ι(G), γ(G) ≤ γc(G), and γ(G) ≤ γp(G). Very little is known about the graphs that satisfy one of these inequalities with equality. I.E. Zverovich and V...
متن کاملDomination in Planar Graphs with Small Diameter II
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213–229) proved that planar graphs of diameter three have domination number at most ten. Recently it was shown (J. Graph Theory 40 (2002), 1–25) that a planar graph of diameter three and of radius two has domination number at most six while every sufficiently large planar graph of diameter three has domination number at most seven. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the London Mathematical Society
سال: 2023
ISSN: ['1469-7750', '0024-6107']
DOI: https://doi.org/10.1112/jlms.12770